#include<bits/stdc++.h> 
using namespace std;
const int N = 5e5 + 10;
typedef long long LL;
LL n, a, b;
 
LL t[N];
bool check(LL x)
{
	LL tmp = 0;
	for(int i = 1; i <= n; i++)
	{
		if(t[i] <= a * x)
			continue;
		LL d = t[i] - a * x;
		tmp = tmp + d / b + (d % b == 0 ? 0 : 1);	
	}
		
	return tmp <= x;	
}
int main()
{
	cin >> n >> a >> b;
	for(int i = 1; i <= n; i++) cin >> t[i];
	int l = 1, r = 5e5;
	while(l < r)
	{
		int mid = (l + r) / 2;
		if(check(mid)) r = mid;
		else l = mid + 1;
	}
	cout << l << endl;
	return 0;
}
